Analog Quantum Variational Embedding Classifier
نویسندگان
چکیده
Quantum machine learning has the potential to provide powerful algorithms for artificial intelligence. The pursuit of quantum advantage in is an active area research. For current noisy, intermediate-scale (NISQ) computers, various quantum-classical hybrid have been proposed. One such previously proposed algorithm a gate-based variational embedding classifier, which composed classical neural network and parameterized circuit. We propose classifier based on analog computer, where control signals vary continuously time. In our algorithm, data transformed into parameters time-varying Hamiltonian computer by linear transformation. nonlinearity needed nonlinear classification problem purely provided through dependence final state Hamiltonian. performed numerical simulations that demonstrate effectiveness performing binary multi-class linearly inseparable datasets as concentric circles MNIST digits. Our can reach accuracy comparable with best classifiers. find performance be increased increasing number qubits until saturates fluctuates. Moreover, optimization scales qubits. increase training when size increases therefore not fast network. presents possibility using annealers solving practical machine-learning problems, it could also useful explore learning.
منابع مشابه
Quantum Minimum Distance Classifier
We propose a quantum version of the well known minimum distance classification model called Nearest Mean Classifier (NMC). In this regard, we presented our first results in two previous works. First, a quantum counterpart of the NMC for two-dimensional problems was introduced, named Quantum Nearest Mean Classifier (QNMC), together with a possible generalization to any number of dimensions. Seco...
متن کاملQuantum decision tree classifier
We study the quantum version of a decision tree classifier to fill the gap between quantum computation and machine learning. The quantum entropy impurity criterion which is used to determine which node should be split is presented in the paper. By using the quantum fidelity measure between two quantum states, we cluster the training data into subclasses so that the quantum decision tree can man...
متن کاملQuantum Variational Autoencoder
Variational autoencoders (VAEs) are powerful generative models with the salient ability to perform inference. Here, we introduce a quantum variational autoencoder (QVAE): a VAE whose latent generative process is implemented as a quantum Boltzmann machine (QBM). We show that our model can be trained end-to-end by maximizing a well-defined loss-function: a “quantum” lowerbound to a variational ap...
متن کاملQuantum Annealing and Analog Quantum Computation
We review here the recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations. The concept is introduced in successive steps through the studies of mapping of such computationally hard problems to the classical spin glass problems. The quantum spin glass problems arise with the introduction of quantum fluctuations, a...
متن کاملEmbedding classical into quantum computation
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits (Valiant’s theorem) appear as two special cases. Viewing these simulatable classes as subsets of the space of all quantum computations, we may consider minimal extens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical review applied
سال: 2023
ISSN: ['2331-7043', '2331-7019']
DOI: https://doi.org/10.1103/physrevapplied.19.054023